Convergence of Prox-Regularization Methods for Generalized Fractional Programming
نویسندگان
چکیده
منابع مشابه
Convergence of Prox-Regularization Methods for Generalized Fractional Programming
We analyze the convergence of the prox-regularization algorithms introduced in [1], to solve generalized fractional programs, without assuming that the optimal solutions set of the considered problem is nonempty, and since the objective functions are variable with respect to the iterations in the auxiliary problems generated by Dinkelbach-type algorithms DT1 and DT2, we consider that the regula...
متن کاملConvergence of interval-type algorithms for generalized fractional programming
The purpose of this paper is to analyze the convergence of interval-type algorithms for solving the generalized fractional program. They are characterized by an interval [LBk, UBk] including A*, and the length of the interval is reduced at each iteration. A closer analysis of the bounds LBk and UBk allows to modify slightly the best known interval-type algorithm NEWMODM accordingly to prove its...
متن کاملAlgorithms for generalized fractional programming
A generalized fractional programming problem is specified as a nonlinear program where a nonlinear function defined as the maximum over several ratios of functions is to be minimized on a feasible domain of ~n. The purpose of this paper is to outline basic approaches and basic types of algorithms available to deal with this problem and to review their convergence analysis. The conclusion includ...
متن کاملRegularization Methods for Semidefinite Programming
We introduce a new class of algorithms for solving linear semidefinite programming (SDP) problems. Our approach is based on classical tools from convex optimization such as quadratic regularization and augmented Lagrangian techniques. We study the theoretical properties and we show that practical implementations behave very well on some instances of SDP having a large number of constraints. We ...
متن کاملGeneralized Bregman Distances and Convergence Rates for Non-convex Regularization Methods
We generalize the notion of Bregman distance using concepts from abstract convexity in order to derive convergence rates for Tikhonov regularization with non-convex regularization terms. In particular, we study the non-convex regularization of linear operator equations on Hilbert spaces, showing that the conditions required for the application of the convergence rates results are strongly relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2002
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2002006